Eigenvalue Decomposition of a Cumulant Tensor with Applications
نویسندگان
چکیده
منابع مشابه
A Multilinear Singular Value Decomposition
We discuss a multilinear generalization of the singular value decomposition. There is a strong analogy between several properties of the matrix and the higher-order tensor decomposition; uniqueness, link with the matrix eigenvalue decomposition, first-order perturbation effects, etc., are analyzed. We investigate how tensor symmetries affect the decomposition and propose a multilinear generaliz...
متن کاملDiffusion Tensor Representations and Their Applications to DTI Error Propagation
INTRODUCTION The diffusion tensor is a 3x3 positive definite matrix and, therefore, possesses several distinct matrix decompositions, e.g. the Cholesky, and the Eigenvalue decompositions. To date, the Eigenvalue decomposition has been used only in computing tensor-derived quantities [1-4] but not as a parametrization (or equivalently, a representation) in DTI error propagation [5]. Treating a m...
متن کاملRobust Independent Component Analysis via Time-Delayed Cumulant Functions
In this paper we consider blind source separation (BSS) problem of signals which are spatially uncorrelated of order four, but temporally correlated of order four (for instance speech or biomedical signals). For such type of signals we propose a new sufficient condition for separation using fourth order statistics, stating that the separation is possible, if the source signals have distinct nor...
متن کاملThe Main Eigenvalues of the Undirected Power Graph of a Group
The undirected power graph of a finite group $G$, $P(G)$, is a graph with the group elements of $G$ as vertices and two vertices are adjacent if and only if one of them is a power of the other. Let $A$ be an adjacency matrix of $P(G)$. An eigenvalue $lambda$ of $A$ is a main eigenvalue if the eigenspace $epsilon(lambda)$ has an eigenvector $X$ such that $X^{t}jjneq 0$, where $jj$ is the all-one...
متن کاملBlind channel estimation based on maximizing the eigenvalue spread of cumulant matrices in (2 × 1) Alamouti's coding schemes
The popular Alamouti orthogonal space time code attains full transmit diversity in multiple antenna systems. This paper addresses the problem of blind channel identification in (2 × 1) Alamouti coded systems. Under the assumption of independent symbol substreams, the channel can be estimated from the eigendecomposition of matrices composed of secondor higher-order statistics (cumulants) of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017